Non-linear sampling recovery based on quasi-interpolant wavelet representations
نویسنده
چکیده
We investigate a problem of approximate non-linear sampling recovery of functions on the interval I:=[0,1] expressing the adaptive choice of n sampled values of a function to be recovered, and of n terms from a given family of functions Φ. More precisely, for each function f on I, we choose a sequence ξ = {ξs} s =1 n of n points in I, a sequence a = {as}s=1} n of n functions defined on n and a sequence Φn = {Vks} s=1 n of n functions from a given family Φ. By this choice we define a (non-linear) sampling recovery method so that f is approximately recovered from the n sampled values f(ξ 1), f(ξ 2),..., f(ξ n ), by the n-term linear combination S(f) = S(ξ, Φn,a,f):= ∑s=1 na s(f(ξ ),...,f(ξ))V{ks}. In searching an optimal sampling method, we study the quantity νn(f, Φ)q := {Φn, ξ, a}, ||F S(ξ, Φn, a, f)||q, where the infimum is taken over all sequences ξ = {ξ}s=1 n of n points, a = {as}s =1 n of n functions defined on n, and Φn = {Vks}}s=1 n of n functions from Φ. Let Up,θ be the unit ball in the Besov space B α p,θ} and M the set of centered B-spline wavelets Mk,s(x):= Nr(2 k x + ρ s), which do not vanish identically on I , where N r is the B-spline of even order r ≥ [α] + 1 with knots at the points 0,1,...,r. For 1 ≤ p,q ≤ ∞, 0 < θ ≤ ∞ and α > 1, we proved the following asymptotic order νn(U α p,θ, (f M)q:= sup f∞U α p,θ μn(f,M)q n α. An asymptotically optimal non-linear sampling recovery method S * for μn(U α p,θ, (f M)q is constructed by using a quasi-interpolant wavelet representation of functions in the Besov space in terms of the B-splines M k,s and the associated equivalent discrete quasi-norm of the Besov space. For 1 ≤ p < q ≤ ∞ the asymptotic order of this asymptotically optimal sampling non-linear recovery method is better than the asymptotic order of any linear sampling recovery method or, more generally, of any non-linear sampling recovery method of the form R(H,ξ,f): = H(f(ξ 1),...,f(ξ n)) with a fixed mapping H:n to C(I) and n fixed points ξ = {ξs} s=1 n. © 2008 Springer Science+Business Media, LLC. Author
منابع مشابه
Quasi-Orthogonality and Quasi-Projections
Our main concern in this paper is the design of simplified filtering procedures for the quasi-optimal approximation of functions in subspaces of L2 generated from the translates of a function φ(x). Examples of signal representations that fall into this framework are Schoenberg’s polynomial splines of degree n, and the various multiresolution spaces associated with the wavelet transform. After a...
متن کاملSampling and Cubature on Sparse Grids Based on a B-spline Quasi-Interpolation
Let Xn = {x j }j=1 be a set of n points in the d-cube Id := [0, 1]d , and n = {φ j }j=1 a family of n functions on Id . We consider the approximate recovery of functions f on Id from the sampled values f (x1), . . . , f (xn), by the linear sampling algorithm Ln(Xn, n, f ) := ∑nj=1 f (x j )φ j . The error of sampling recovery is measured in the norm of the space Lq(I)-norm or the energy quasi-no...
متن کاملDIV - CURL Vector Quasi - interpolation on a Finite
| This paper presents a quasi-interpolation method for DIV-CURL vector splines in two dimensions on both innnite and nite domains. The quasi-interpolant is a linear combination of translates of dilates of a basis function. In particular, our discussion focuses on the approximation of a vector-valued function deened on a nite domain for practical application purposes. In such a case, edge functi...
متن کاملAsynchronous Representation and Processing of Non–stationary Signals in a Time-frequency Context
Non–stationarity relates to the variation over time of the statistics of a signal. Therefore, signals from practical applications which are realizations of non–stationary processes are difficult to represent and to process. In this paper, we provide a comprehensive discussion of the asynchronous representation and processing of non–stationary signals using a time-frequency framework. Power cons...
متن کاملA quadrature formula associated with a univariate quadratic spline quasi-interpolant
We study a new simple quadrature rule based on integrating a C1 quadratic spline quasi-interpolant on a bounded interval. We give nodes and weights for uniform and non-uniform partitions. We also give error estimates for smooth functions and we compare this formula with Simpson’s rule.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Adv. Comput. Math.
دوره 30 شماره
صفحات -
تاریخ انتشار 2009